Adaptive and Global Routing for Multiplexed Optical Communication on Mesh and Torus Networks
نویسندگان
چکیده
Optical interconnection networks have the potential for achieving low latency and high throughput. Moreover , the high bandwidth of an optical link can be shared by many virtual channels through the use of either multiple wavelengths or multiple time slots. In this paper, routing algorithms are studied for mesh-like ar-chitectures with path-multiplexed or link-multiplexed communications. Deterministic, adaptive and global routing algorithms are evaluated and compared in terms of the multiplexing degree needed to support random communication requests.
منابع مشابه
High-speed All- Optical Time Division Multiplexed Node
In future high-speed self-routing photonic networks based on all-optical time division multiplexing (OTDM) it is highly desirable to carry out packet switching, clock recovery and demultplexing in the optical domain in order to avoid the bottleneck due to the optoelectronics conversion. In this paper we propose a self-routing OTDM node structure composed of an all-optical router and demultiplex...
متن کاملOptimal Routing and Channel Assignments for Hypercube Communication on Optical Mesh–like Processor Arrays
This paper considers optimal routing and channel assignment (RCA) schemes to realize hypercube communication on optical mesh–like networks. Specifically, we identify lower bounds on the number of channels required to realize hypercube communication on top of array and ring topologies and develop optimal RCA schemes that achieve the lower bounds on these two topologies. We further extend the sch...
متن کاملDistributed Path Reservation Algorithms for Multiplexed All-Optical Interconnection Networks
ÐIn this paper, we study distributed path reservation protocols for multiplexed all-optical interconnection networks. The path reservation protocols negotiate the reservation and establishment of connections that arrive dynamically to the network. These protocols can be applied to both wavelength division multiplexing (WDM) and time division multiplexing (TDM) networks. Two classes of protocols...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملMesh and Torus Chaotic Routing
The chaos router is an adaptive nonminimal message router for multicomputers that is simple enough to compete with the fast, oblivious routers now in use in commercial machines. It improves on previous adaptive routers by using randomization, which eliminates the need for complex livelock protection and speeds the router. The two-dimensional chaos router is shown to be theoretically sound and p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997